An Analytic Center Cutting Plane Method
نویسندگان
چکیده
Semideenite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as nding a point in a nonempty bounded convex body ? in the cone of symmetric positive semideenite matrices. Assume that ? is deened by an oracle, which, for any given m m symmetric matrix ^ Y , either connrms that ^ Y 2 ? or returns a cut, i.e., a symmetric matrix A such that ? is in the half-space fY j A Y A ^ Y g: We study an analytic center cutting plane algorithm for this problem. At each iteration the algorithm computes an approximate analytic center of a working set deened by the cutting-plane system generated in the previous iterations. If this approximate analytic center is a solution, then the algorithm terminates; otherwise the new cutting plane returned by the oracle is added into the system. As the number of iterations increases, the working set shrinks and the algorithm eventually nds a solution of the problem. All iterates generated by the algorithm are positive deenite matrices due to log-determinant barrier terms in the potential function. The algorithm has a worst case complexity of O (m 3 == 2) on the total number of cuts to be used, where is the maximum radius of a ball contained by ?.
منابع مشابه
Localization and Cutting-Plane Methods
4 Some specific cutting-plane methods 12 4.1 Bisection method on R . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 4.2 Center of gravity method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 4.3 MVE cutting-plane method . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.4 Chebyshev center cutting-plane method . . . . . . . . . . . . . . . . . . . . . 16 4.5 ...
متن کاملA Proximal Analytic Center Cutting Plane Algorithm for Solving Variational Inequality Problems
Under the condition that the values of mapping F are evaluated approximately, we propose a proximal analytic center cutting plane algorithm for solving variational inequalities. It can be considered as an approximation of the earlier cutting plane method, and the conditions we impose on the corresponding mappings are more relaxed. The convergence analysis for the proposed algorithm is also give...
متن کاملAn Analytic Center Cutting Plane Method for Semideenite Feasibility Problems
Semideenite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as nding a point in a nonempty bounded convex body ? in the cone of symmetric positive semideenite matrices. Assume that ? is deened by an oracle, which for any given m m symmetric positive semideenite matrix ^ Y either connrms that ^ Y 2 ? or returns a cut, i.e., a ...
متن کاملHomogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
In this paper we consider a new analytic center cutting plane method in a projective space. We prove the eeciency estimates for the general scheme and show that these results can be used in the analysis of a feasibility problem, the variational inequality problem and the problem of constrained minimization. Our analysis is valid even for the problems whose solution belongs to the boundary of th...
متن کاملAn analytic center cutting plane method for pseudomonotone variational inequalities
We consider an analytic center algorithm for solving generalized monotone variational inequalities in R", which adapts a recent result due to Goffin et al. (1993) to the numerical resolution of continuous pseudomonotone variational inequalities.
متن کامل